Böhm-Like Trees for Term Rewriting Systems
نویسنده
چکیده
In this paper we define Böhm-like trees for term rewriting systems (TRSs). The definition is based on the similarities between the Böhm trees, the Lévy-Longo trees, and the Berarducci trees. That is, the similarities between the Böhm-like trees of the λ-calculus. Given a term t a tree partially represents the root-stable part of t as created in each maximal fair reduction of t. In addition to defining Böhm-like trees for TRSs we define a subclass of Böhm-like trees whose members are monotone and continuous.
منابع مشابه
Skew and ω-Skew Confluence and Abstract Böhm Semantics
Skew confluence was introduced as a characterization of nonconfluent term rewriting systems that had unique infinite normal forms or Böhm like trees. This notion however is not expressive enough to deal with all possible sources of non-confluence in the context of infinite terms or terms extended with letrec. We present a new notion called ωskew confluence which constitutes a sufficient and nec...
متن کاملPartial Order Infinitary Term Rewriting and Böhm Trees
We investigate an alternative model of infinitary term rewriting. Instead of a metric, a partial order on terms is employed to formalise (strong) convergence. We compare this partial order convergence of orthogonal term rewriting systems to the usual metric convergence of the corresponding Böhm extensions. The Böhm extension of a term rewriting system contains additional rules to equate so-call...
متن کاملThe defining core of a theory of infinitary term rewriting is its notion of convergence for transfinite reductions: which transfinite reductions
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial order model restricted to total terms. Hence, partial order convergence constitutes a cons...
متن کاملHighlights in infinitary rewriting and lambda calculus
We present some highlights from the emerging theory of infinitary rewriting, both for first-order term rewriting systems and λ-calculus. In the first section we introduce the framework of infinitary rewriting for first-order rewrite systems, so without bound variables. We present a recent observation concerning the continuity of infinitary rewriting. In the second section we present an excursio...
متن کاملSkew and ω-Skew Confluence and Infinite Normal Forms
The notion of skew confluence was introduced to characterize non-confluent term rewriting systems that had unique infinite normal forms or Böhm like trees. This notion however is not expressive enough to deal with all possible sources of non-confluence in the context of infinite terms or terms extended with letrec. To that end, we present a new notion called ω-skew confluence. We show that ω-sk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004